Wilhelm Meyerhoffer. (13. September 1864–21. April 1906)

of April 13 , 2017 . This

of April 13 , 2017 . This

Lecture 12 : April 13 , 2017

Last Time During the last lecture we completed an argument for a 2 1 d−1 ) lower bound for depth-d circuits for parity (PAR) using Hastad’s Switching Lemma [H̊as87], which stated that, for f : {0, 1} → {−1, 1}, if CNFwidth(f) = t, Pρ←Rp(DNFwidth(f ρ) = s) ≥ (7ps) We proved the Weak Switching Lemma, asserting a (40ps2) lower bound for this probability as opposed to the tighter bound given by the ...

Washington University Record, September 13, 2007

Erratum, Vol. 13, April 28 Release

[This corrects the article DOI: 10.5888/pcd13.150500.].